Semilocal Convergence of Two Iterative Methods for Simultaneous Computation of Polynomial Zeros
نویسنده
چکیده
In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich’s and Nourein’s iterations. Our theorems generalize and improve recent results of Zheng and Huang [J. Comput. Math. 18 (2000), 113– 122], Petković and Herceg [J. Comput. Appl. Math. 136 (2001), 283–307] and Nedić [Novi Sad J. Math. 31 (2001), 103–111]. We also present a new sufficient condition for simple zeros of a polynomial.
منابع مشابه
A New Semilocal Convergence Theorem for the Weierstrass Method from Data at One Point
In this paper we present a new semilocal convergence theorem from data at one point for the Weierstrass iterative method for the simultaneous computation of polynomial zeros. The main result generalizes and improves all previous ones in this area.
متن کاملRelationships between different types of initial conditions for simultaneous root finding methods
The construction of initial conditions of an iterative method is one of the most important problems in solving nonlinear equations. In this paper, we obtain relationships between different types of initial conditions that guarantee the convergence of iterative methods for simultaneous finding all zeros of a polynomial. In particular, we show that any local convergence theorem for a simultaneous...
متن کاملOn a family of Weierstrass-type root-finding methods with high order of convergence
in English: In 1985, Kyurkchiev and Andreev [1] constructed a sequence of iterative methods for finding all zeros of a polynomial simultaneously. In the literature there are only local convergence results for these methods (see [1, 5]). In this talk, we present a semilocal convergence theorem for Kyurkchiev-Andreev’s methods under computationally verifiable initial conditions and with an a post...
متن کاملA note on some improvements of the simultaneous methods for determination of polynomial zeros
Absrrucr: Applying Gauss-Seidel approach to the improvements of two simultaneous methods for finding polynomial zeros, presented in [9], two iterative methods with faster convergence are obtained. The lower bounds of the R-order of convergence for the accelerated methods are given. The improved methods and their accelerated modifications arc discussed in view of the convergence order and the nu...
متن کاملLaguerre-like Methods for the Simultaneous Approximation of Polynomial Multiple Zeros
Two new methods of the fourth order for the simultaneous determination of multiple zeros of a polynomial are proposed. The presented methods are based on the fixed point relation of Laguerre's type and realized in ordinary complex arithmetic as well as circular complex interval arithmetic. The derived iterative formulas are suitable for the construction of modified methods with improved converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008